Programming of channels in generalized probabilistic theories

نویسندگان

چکیده

For a given target system and apparatus described by quantum theory, the so-called no-programming theorem indicates that family of states called programs in with fixed unitary operation on total distinct dynamics to only if initial are orthogonal each other. The current study aims at revealing whether similar behavior can be observed generalized probabilistic theories (GPTs). Generalizing programming scheme GPTs, we derive theorem. We, furthermore, demonstrate reversible is closely related curious structure named quasi-classical state space. Programming irreversible dynamics, i.e., channels, GPTs also investigated.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structure of Optimal State Discrimination in Generalized Probabilistic Theories

We consider optimal state discrimination in a general convex operational framework, so-called generalized probabilistic theories (GPTs), and present a general method of optimal discrimination by applying the complementarity problem from convex optimization. The method exploits the convex geometry of states but not other detailed conditions or relations of states and effects. We also show that p...

متن کامل

Communication complexity of channels in general probabilistic theories.

The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum state. At present, only little is known about this quantity. In this Letter, we present a procedure for systematically evaluating the communication complexity o...

متن کامل

Monolingual Probabilistic Programming Using Generalized Coroutines

Probabilistic programming languages and modeling toolkits are two modular ways to build and reuse stochastic models and inference procedures. Combining strengths of both, we express models and inference as generalized coroutines in the same general-purpose language. We use existing facilities of the language, such as rich libraries, optimizing compilers, and types, to develop concise, declarati...

متن کامل

Probabilistic Theories of Causality

This chapter provides an overview of a range of probabilistic theories of causality, including those of Reichenbach, Good and Suppes, and the contemporary causal net approach. It discusses two key problems for probabilistic accounts: counterexamples to these theories and their failure to account for the relationship between causality and mechanisms. It is argued that to overcome the problems, a...

متن کامل

Computation in generalised probabilistic theories

From the general difficulty of simulating quantum systems using classical systems, and in particular the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation is that BQP ⊆ AWPP, where AWPP is a classical complexity cla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Physics

سال: 2023

ISSN: ['0022-2488', '1527-2427', '1089-7658']

DOI: https://doi.org/10.1063/5.0101198